The multiplication game
نویسنده
چکیده
You walk into a casino, and just inside the main entrance you see a new game to play—the Multiplication Game. You sit at a table opposite the dealer and place your bet. The dealer hits a button and from a slot in the table comes a slip of paper with a number on it that you cannot see. You use a keypad to choose a number of your own—any positive integer you like, with as many digits as you like. Your number is printed on the slip of paper along with the product of the two numbers. The dealer shows you the slip so that you can verify that the product is correct. You win if the first digit of the product is 4 through 9; you lose if it is 1, 2, or 3. The casino pays even odds: for a winning bet of one dollar the casino returns your dollar and one more. Should you stay and play? It looks tempting. You you have six winning digits and the casino has only three! But being skeptical, you take a few minutes to calculate. You write the multiplication table of the digits from one to nine. Of the 81 products you see that 44 of them begin with 1, 2, or 3, and only 37 begin with 4 through 9. Suddenly, even odds do not seem so attractive! You abandon the game and walk further into the casino. In the next room you find another table with the same game, but better odds. This table pays $1.25 for a winning one dollar bet. From your previous count you figure that if the odds favor the casino by 44:37, then a fair payout would be 44/37 dollars for a dollar bet; that is almost $1.19, and this table is offering more. Should you stay and play? You open your laptop and write a computer program to count the products of the two digit numbers from 10 to 99. (You realize immediately that in this game multiplying by 1, 2, . . . , 9 is the same as multiplying by 10, 20, . . . , 90, and so you leave out the one digit numbers.) You find that of these 8100 products the casino has 4616 winners and you
منابع مشابه
Game Theoretic Analysis of Multi-Processor Schedulers: Matrix Multiplication Example
This paper deals with a game model of users performing parallel computing in a heterogeneous multiprocessor system. The proposed approach is applied to the problem of matrix multiplication on the system with the scheduler of min-min type. The user’s action is to choose the size of the blocks into which the matrix is cut. Each user tries to optimize own finish time, which leads to conflict. Usin...
متن کاملSpace-time Tradeoos in Memory Hierarchies Space-time Tradeoos in Memory Hierarchies
The speed of CPUs is accelerating rapidly, outstripping that of peripheral storage devices and making it increasingly di cult to keep CPUs busy. Multilevel memory hierarchies, scaled to simulate single-level memories, are increasing in importance. In this paper we introduce the Memory Hierarchy Game, a multi-level pebble game simulating data movement in memory hierarchies for straight-line comp...
متن کاملVanishing and Non-Vanishing Criteria for Branching Schubert Calculus by
Vanishing and Non-Vanishing Criteria for Branching Schubert Calculus by Kevin Purbhoo Doctor of Philosophy in Mathematics University of California at Berkeley Professor Allen Knutson, Chair We investigate several related vanishing problems in Schubert calculus. First we consider the multiplication problem. For any complex reductive Lie group G, many of the structure constants of the ordinary co...
متن کاملAdaptive and Bounded Investment Returns Promote Cooperation in Spatial Public Goods Games
The public goods game is one of the most famous models for studying the evolution of cooperation in sizable groups. The multiplication factor in this game can characterize the investment return from the public good, which may be variable depending on the interactive environment in realistic situations. Instead of using the same universal value, here we consider that the multiplication factor in...
متن کاملA New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure
The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...
متن کاملA Decoding Scheme for the 4 - Ary Lexicodes with D = 3
We introduce the algorithms for basis and decoding of quaternary lexicographic codes with minimum distance d = 3 for an arbitrary length n. 1. Introduction. In this section, we define some particular operations and discuss q-ary lexicographic codes with minimum distance d. The game-theoretic operations of nim-addition ⊕ and nim-multiplication ⊗ which are used in the Game of Nim are introduced b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1208.1329 شماره
صفحات -
تاریخ انتشار 2010